Prime Number Races
نویسندگان
چکیده
There’s nothing quite like a day at the races . . . . The quickening of the pulse as the starter’s pistol sounds, the thrill when your favorite contestant speeds out into the lead (or the distress if another contestant dashes out ahead of yours), and the accompanying fear (or hope) that the leader might change. And what if the race is a marathon? Maybe one of the contestants will be far stronger than the others, taking the lead and running at the head of the pack for the whole race. Or perhaps the race will be more dramatic, with the lead changing again and again. Our race involves the odd prime numbers, divided into two teams. Come to this talk to learn more about these races, and hear the speaker’s analysis of which team he expects to win and why. This talk should be accessible to undergraduates. 1112713106
منابع مشابه
Prime number races and zeros of Dirichlet L-functions 09rit148
This Research in Teams meeting focused on the finer behaviour of the function π(x; q, a), which denotes the number of prime numbers of the form qn+ a that are less than or equal to x. Dirichlet’s famous theorem on primes in arithmetic progressions asserts that that there are infinitely many primes of the form qn + a when a is a reduced residue modulo q (that is, when a and q are relatively prim...
متن کاملResidue races by Andrew Granville , Daniel Shiu and Peter Shiu
Given a prime p and distinct non-zero integers a1, a2, . . . , ak (mod p), we investigate the number N = N(a1, a2, . . . , ak; p) of residues n (mod p) for which (na1)p < (na2)p < . . . < (nak)p, where (b)p is the least non-negative residue of b (mod p). We give complete solutions to the problem when k = 2, 3, 4, and establish some general results corresponding to k ≥ 5. 2000 Mathematics Subjec...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملA note on 3-Prime cordial graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 113 شماره
صفحات -
تاریخ انتشار 2006